Unification and Narrowing in Maude 2.4
نویسندگان
چکیده
Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications, and has a relatively large worldwide user and open-source developer base. This paper introduces novel features of Maude 2.4 including support for unification and narrowing. Unification is supported in Core Maude, the core rewriting engine of Maude, with commands and metalevel functions for order-sorted unification modulo some frequently occurring equational axioms. Narrowing is currently supported in its Full Maude extension. We also give a brief summary of the most important features of Maude 2.4 that were not part of Maude 2.0 and earlier releases. These features include communication with external objects, a new implementation of its module algebra, and new predefined libraries. We also review some new Maude applications.
منابع مشابه
Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
This paper introduces some novel features of Maude 2.6 focusing on the variants of a term. Given an equational theory (Σ,Ax∪E), the E,Ax-variants of a term t are understood as the set of all pairs consisting of a substitution σ and the E,Ax-canonical form of tσ . The equational theory (Ax∪E) has the finite variant property iff there is a finite set of most general variants. We have added suppor...
متن کاملInspecting Maude variants with GLINTS
This paper introduces GLINTS, a graphical tool for exploring variant narrowing computations in Maude. The most recent version of Maude, version 2.7.1, provides quite sophisticated unification features, including order-sorted equational unification for convergent theories modulo axioms such as associativity, commutativity, and identity (ACU). This novel equational unification relies on built-in ...
متن کاملUnification and Anti-unification modulo Equational Theories
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. If E can be split as a disjoint union R ∪ Ax in such a way that R is a set of rewrite rules that are confluent, terminating, sort-decreasing, and coherent modulo a set of equational axioms Ax, it is well-known that narrowing with R modulo Ax provides a complete E-unification algorithm. However, na...
متن کاملProtocol Analysis Modulo Combination of Theories: A Case Study in Maude-NPA
There is a growing interest in formal methods and tools to analyze cryptographic protocols modulo algebraic properties of their underlying cryptographic functions. It is well-known that an intruder who uses algebraic equivalences of such functions can mount attacks that would be impossible if the cryptographic functions did not satisfy such equivalences. In practice, however, protocols use a co...
متن کاملLifting Term Rewriting Derivations in Constructor Systems by Using Generators
Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation starting from an instance of an expression can be ‘lifted’ to a narrowing derivation, whenever the substitution employed is normalized. In this paper we adapt the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009